Semantic Construction from Parse Forests
نویسنده
چکیده
The paper describes a system which uses packed parser output directly to build semantic representations. More specifically, the system takes as input Packed Shared Forests in the sense of Tomita (l_bmita, 1985) and produces packed Underspeeified Discourse Representation Structures. The algorithm visits every node in the Parse Forest only a bounded number of times, so that a significant increase in efficiency is registered for ambiguous sentences.
منابع مشابه
Eecient Decoration of Parse Forests 4.1 Introduction
Large subsets of natural languages can be described using context-free grammars extended with some kind of parameter mechanism, e.g. aax grammars, attribute grammars, and deenite clause grammars. This paper deals with aax grammars over a nite lattice (AGFLs). The parameters in AGFLs are called aaxes. AGFLs are a simple formalism but have still been proved powerful enough for the description of ...
متن کاملEfficient Semantic Deduction and Approximate Matching over Compact Parse Forests
Semantic inference is often modeled as application of entailment rules, which specify generation of entailed sentences from a source sentence. Efficient generation and representation of entailed consequents is a fundamental problem common to such inference methods. We present a new data structure, termed compact forest, which allows efficient generation and representation of entailed consequent...
متن کاملEfficient Construction of Underspecified Semantics under Massive Ambiguity
We investigate the problem of determining a compact underspecified semantical representation for sentences that may be highly ambiguous. Due to combinatorial explosion, the naive method of building semantics for the different syntactic readings independently is prohibitive. We present a method that takes as input a syntactic parse forest with associated constraintbased semantic construction rul...
متن کاملParse Forest Diagnostics with Dr. Ambiguity
In this paper we propose and evaluate a method for locating causes of ambiguity in context-free grammars by automatic analysis of parse forests. A parse forest is the set of parse trees of an ambiguous sentence. Deducing causes of ambiguity from observing parse forests is hard for grammar engineers because of (a) the size of the parse forests, (b) the complex shape of parse forests, and (c) the...
متن کاملA real-time robotic model of human reference resolution using visual constraints
Evidence from recent psycholinguistic experiments suggests that humans resolve reference incrementally in the presence of constraining visual context. In this paper, we present and evaluate a computational model of human reference resolution that directly builds a semantic interpretation of an utterance without the need for a separate syntactic analysis phase, which typically involves the const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996